Resource Tableaux ( extended abstract )

Tableaux with Automata ( Extended Abstract )

Resource-Adaptive Model Generation as a Performance Model

Model generation calculi, close relatives of tableau calculi for theorem proving, can be used as competence models for semantic natural language understanding. Unfortunately, existing model generation calculi are not yet plausible as performance models of actual human processing, since they fail to capture computational aspects of human language processing. We outline an extended model generati...

A Tableau Compiled Labelled Deductive System for Hybrid Logic

Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...

Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs

We introduce an extended tableau calculus for answer set programming (ASP). The proof system is based on the ASP tableaux defined in [Gebser&Schaub, ICLP 2006], with an added extension rule. We investigate the power of Extended ASP Tableaux both theoretically and empirically. We study the relationship of Extended ASP Tableaux with the Extended Resolution proof system defined by Tseitin for clau...

A Substructural Epistemic Resource Logic ( Extended Version ) 17 October , 2016 Didier Galmiche Pierre Kimmel

We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...